An Axiomatic System for Concessive Conditionals

نویسندگان

چکیده

Abstract According to the analysis of concessive conditionals suggested by Crupi and Iacona, a conditional $$p{{\,\mathrm{\hookrightarrow }\,}}q$$ p ↪ q is adequately formalized as conjunction conditionals. This paper presents sound complete axiomatic system for so understood. The soundness completeness proofs that will be provided rely on method has been employed Raidl, prove an analogous evidential

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Concessive Conditionals and Alternative NPs in English

There are many ways in which language can describe the dependency of one occurrence on another and hence many varieties of conditional construction, including conditionals in ‘if’, ‘when’, ‘since’, and ‘as’, the absolutive conditionals of Stump (1985), and the correlative conditional construction (‘the more, the merrier’) discussed in Fillmore (1986). This paper will be concerned with investiga...

متن کامل

An Axiomatic System for Peirce’s Alpha Graphs

This paper presents a Hilbert-style system for Alpha graphs, the first part of Existential Graphs. A set of generalized Sheffer-strokes are the only connectives in the “symbol-based” formal system for Alpha graphs, and the most important advantage of the system is that both the decision procedure and the completeness’s proof via countermodel are immediate.

متن کامل

Towards an Axiomatic System for Kolmogorov Complexity

In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion. In this paper, we try to extend this work, both by looking at alternative axiomatic systems for plain complexity and by considering potential axiomatic systems for other types of complexity. First we show that ...

متن کامل

Axiomatic System for Order Dependencies

Dependencies play an important role in database theory. We study order dependencies (ODs) and unidirectional order dependencies (UODs), which describe the relationships among lexicographical orderings of sets of tuples. We investigate the axiomatization problem for order

متن کامل

A System for Axiomatic Programming

We present the design and implementation of a system for axiomatic programming, and its application to mathematical software construction. Key novelties include a direct support for user-defined axioms establishing local equalities between types, and overload resolution based on equational theories and user-defined local axioms. We illustrate uses of axioms, and their organization into concepts...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Studia Logica

سال: 2023

ISSN: ['0039-3215', '1572-8730']

DOI: https://doi.org/10.1007/s11225-022-10034-1